Size Switching in Multi-agent Formation Control

نویسندگان

  • Samuel D. Coogan
  • Jeff S. Shamma
  • Douglas B. Williams
چکیده

Acknowledgements My sincerest thank you to Dr. Magnus Egerstedt, whose teaching and mentorship has helped me grow tremendously as a student and a researcher. He agreed to mentor my undergraduate research with little incentive, and provided invaluable advice and lessons about more than just my research. It is largely because of him that I have decided to continue my education towards a PhD. I'd also like to thank Dr. Jeff Shamma, who helped me finalize my thesis in his official role as my second reader. But, perhaps more importantly, Prof. Shamma assisted me greatly while I was selecting graduate schools and exposed me to a number of topics in the field, both in the classroom and in his office. Although he did not have a direct role in the completion of my thesis, I would like to acknowledge Dr. David Taylor, who also provided indispensable graduate school advise and research mentorship as I completed the Research Option and worked to identify my research interests.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Exponential Convergence of Coordination Learning Control for Multi-agent Formation ⋆

The exponential convergence problem is studied for coordination learning control of multi-agent formation under the switching network topology. A necessary and sufficient condition on exponential convergence is presented for coordination learning control algorithms of multi-agent formation tasks without any reference as prior knowledge. Moreover, it is shown that the developed results are effec...

متن کامل

Formation Control of Multi-agent Systems with Stochastic Switching Topology and Time-Varying Communication Delays

This paper formulates and studies the distributed formation problems of multi-agent systems (MAS) with randomly switching topologies and time-varying delays. The nonlinear dynamic of each agent at different time-interval corresponds to different switching mode which reflects the changing of traveling path in practical systems. The communication topology of the system is switching among finite m...

متن کامل

An iterative learning approach to formation control of multi-agent systems

In this paper, an efficient framework is proposed to the formation control problem ofmultiple agentswith unknown nonlinear dynamics, by means of the iterative learning approach. In particular, a distributed Dtype iterative learning scheme is developed for the multi-agent system with switching topology, whose switching time and sequence are allowed to be varied at different iterations according ...

متن کامل

Cooperative Control of Mobile Robots in Creating a Runway Platform for Quadrotor Landing

Multi-agent systems are systems in which several agents accomplish a mission in a cooperative manner. In this paper, a novel idea for the construction of a movable runway platform based on multi-agent systems is presented. It is assumed that an aerial agent (quadrotor) decides to make an emergency landing due to reasons such as a decrease in energy level or technical failure, while there is no ...

متن کامل

Distributed consensus of multi-agent systems with general linear node dynamics and intermittent communications

Without assuming that the mobile agents can communicate with their neighbors all the time, the consensus problem of multi-agent systems with general linear node dynamics and a fixed directed topology is investigated. To achieve consensus, a new class of distributed protocols designed based only on the intermittent relative information are presented. By using tools from matrix analysis and switc...

متن کامل

Fault Detection and Isolation of Multi-Agent Systems via Complex Laplacian

This paper studies the problem of fault detection and isolation (FDI) for multi-agent systems (MAS) via complex Laplacian subject to actuator faults. A planar formation of point agents in the plane using simple and linear interaction rules related to complex Laplacian is achieved. The communication network is a directed, and yet connected graph with a fixed topology. The loss of symmetry in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010